翻訳と辞書 |
Yao's XOR lemma : ウィキペディア英語版 | Yao's test In cryptography and the theory of computation, Yao's test is a test defined by Andrew Chi-Chih Yao in 1982 ,〔Andrew Chi-Chih Yao. (Theory and applications of trapdoor functions ). In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.〕 against pseudo-random sequences. A sequence of words passes Yao's test if an attacker with reasonable computational power cannot distinguish it from a sequence generated uniformly at random. == Formal statement==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Yao's test」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|